Integrating Pareto Optimization into Dynamic Programming
نویسندگان
چکیده
منابع مشابه
Integrating Pareto Optimization into Dynamic Programming
Pareto optimization combines independent objectives by computing the Pareto front of the search space, yielding a set of optima where none scores better on all objectives than any other. Recently, it was shown that Pareto optimization seamlessly integrates with algebraic dynamic programming: when scoring schemes A and B can correctly evaluate the search space via dynamic programming, then so ca...
متن کاملOptimization II: Dynamic Programming
In the last chapter, we saw that greedy algorithms are efficient solutions to certain optimization problems. However, there are optimization problems for which no greedy algorithm exists. In this chapter, we will examine a more general technique, known as dynamic programming, for solving optimization problems. Dynamic programming is a technique of implementing a top-down solution using bottom-u...
متن کاملDifferential conditions for constrained nonlinear programming via Pareto optimization
We deal with differential conditions for local optimality. The conditions we derive for inequality constrained problems do not require constraint qualifications and are the broadest conditions based only on first and second order derivatives. A similar result is proved for equality constrained problems, although necessary conditions require regularity of the equality constraints.
متن کاملIntegrating Interval Constraints into Logic Programming
The clp scheme uses Horn clauses and sld resolution to generate multiple constraint satisfaction problems (csps). The possible csps include rational trees (giving Prolog) and numerical algorithms for solving linear equations and linear programs (giving clp(r)). In this paper we develop a form of csp for interval constraints. In this way one obtains a logic semantics for the efficient floating-p...
متن کاملIntegrating Efficient Records into Concurrent Constraint Programming
We show how to implement eecient records in constraint logic programming (CLP) and its generalization concurrent constraint programming (CCP). Records can be naturally integrated into CCP as a new constraint domain. The implementation provides the added expressive power of concurrency and ne-grained constraints over records, yet does not pay for this expressivity when it is not used. In additio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2016
ISSN: 1999-4893
DOI: 10.3390/a9010012